Bi-rewriting Rewriting Logic1 1Supported by project DISCOR (TIC 94-0847-C02-01) funded by the CICYT
نویسندگان
چکیده
منابع مشابه
Bi-rewriting rewriting logic
Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...
متن کاملControlling rewriting by rewriting
In this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies. We illustrate the syntax, semantics and diierent features of this strategy language. Fina...
متن کاملBi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ −→ and rewriting a to b, we use another rewriting relation ⊇ −→ as well and seek a common expression c such that a ⊆ −→ ∗ c and b ⊇ −→ ∗ c. Each component of the bi-rewriting system 〈 ⊆ −→, ⊇ −→〉 is allowed to be a subset ...
متن کاملThe rewriting logic semantics project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balan...
متن کاملData refinement by rewriting
One of the activities in the step-wise development of programs is the transformation of abstract programs involving abstract data types, such as graphs, sets, and sequences, that are not normally available as primitive in programming languages, into executable concrete programs in which a representation of these types is provided. Apart from the change of data representation, such a data refine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1996
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00043-x